Computation of the fractional Fourier transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Digital computation of the fractional Fourier transform

An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.

متن کامل

A method for the discrete fractional Fourier transform computation

A new method for the discrete fractional Fourier transform (DFRFT) computation is given in this paper. With the help of this method, the DFRFT of any angle can be computed by a weighted summation of the DFRFTs with the special angles.

متن کامل

A novel method for discrete fractional Fourier transform computation

Fractional Fourier transform (FRFT) is a generalization of Fourier transform, and it indicates a rotation of signal in the time-frequency plane[l). The FRFT has been widely successfully used in the many areas[l][2]. Because of the importance of FRFT, discrete fractional Fourier transform (DFRFT) becomes an important issue in recent years[3][4] [5][6]. In the development of DFRFT, the DFRFT has ...

متن کامل

The discrete fractional Fourier transform

We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of...

متن کامل

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Computational Harmonic Analysis

سال: 2004

ISSN: 1063-5203

DOI: 10.1016/j.acha.2004.02.001